#define _CRT_SECURE_NO_WARNINGS

#include "Sort.h"

void TestInsertSort()
{
	int a[] = { 9,8,7,6,5,4,3,2,1,0 };

	InsertSort(a, sizeof(a) / sizeof(a[0]));

	printf("InsertSort->\n");
	PrintSort(a, sizeof(a) / sizeof(a[0]));

}

void TestShellSort()
{
	int a[] = { 9,8,7,6,5,4,3,2,1,0 };

	ShellSort(a, sizeof(a) / sizeof(a[0]));

	printf("ShellSort->\n");
	PrintSort(a, sizeof(a) / sizeof(a[0]));

}

void TestSelectSortP()
{
	int a[] = { 9,8,7,6,5,4,3,2,1,0 };

	SelectSort(a, sizeof(a) / sizeof(a[0]));

	printf("SelectSort->\n");
	PrintSort(a, sizeof(a) / sizeof(a[0]));
}

void TestBubbleSort()
{

	int a[] = { 9,8,7,6,5,4,3,2,1,0 };

	BubbleSort(a, sizeof(a) / sizeof(a[0]));

	printf("BubbleSort->\n");
	PrintSort(a, sizeof(a) / sizeof(a[0]));


}

void TestHeapSort()
{
	//int a[] = { 9,8,7,6,5,4,3,2,1,0 };
	//int a[] = { 10,20,28,1,2,3,9,8,17,34,81,56 };
	int a[] = { 6,1,2,7,9,3,4,5,10,8 };


	HeapSort(a, sizeof(a) / sizeof(a[0]));

	printf("HeapSort->\n");
	PrintSort(a, sizeof(a) / sizeof(a[0]));
}

void TestQuickSort()
{
	int a[] = { 6,1,2,7,9,3,4,5,10,8 };

	QuickSort(a, 0, sizeof(a) / sizeof(a[0]) - 1);

	printf("QuickSort->\n");
	PrintSort(a, sizeof(a) / sizeof(a[0]));

}

void TestOptimizeQuickSort()
{
	int a[] = { 6,1,2,7,9,3,4,5,10,8 };

	QuickSort(a, 0, sizeof(a) / sizeof(a[0]) - 1);

	printf("QuickSort->\n");
	PrintSort(a, sizeof(a) / sizeof(a[0]));

}

void TestQuickSortNonR()
{
	int a[] = { 6,1,2,7,9,3,4,5,10,8 };

	QuickSortNonR(a, 0, sizeof(a) / sizeof(a[0]) - 1);

	printf("QuickSortNonR->\n");
	PrintSort(a, sizeof(a) / sizeof(a[0]));
}


void TestMergeSort()
{
	int a[] = { 6,1,2,7,9,3,4,5,10,8 };

	MergeSort(a, sizeof(a) / sizeof(a[0]));

	printf("MergeSort->\n");
	PrintSort(a, sizeof(a) / sizeof(a[0]));
}


void TestMergeSortNonR()
{
	int a[] = { 6,1,2,7,9,3,4,5,10,8 };

	MergeSortNonR(a, sizeof(a) / sizeof(a[0]));

	printf("MergeSortNonR->\n");
	PrintSort(a, sizeof(a) / sizeof(a[0]));

}


void TestOP()
{
	srand(time(0));
	const int N = 10000;
	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);
	int* a5 = (int*)malloc(sizeof(int) * N);
	int* a6 = (int*)malloc(sizeof(int) * N);
	int* a7 = (int*)malloc(sizeof(int) * N);

	for (int i = 0; i < N; ++i)
	{
		a1[i] = rand();
		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];
		a7[i] = a1[i];
	}


	int begin1 = clock();
	//InsertSort(a1, N);
	int end1 = clock();

	int begin2 = clock();
	//ShellSort(a2, N);
	int end2 = clock();

	int begin3 = clock();
	//SelectSort(a3, N);
	int end3 = clock();

	int begin4 = clock();
	//HeapSort(a4, N);
	int end4 = clock();

	int begin5 = clock();
	//QuickSort(a5, 0, N - 1);
	int end5 = clock();

	int begin6 = clock();
	//MergeSort(a6, N);
	int end6 = clock();

	int begin7 = clock();
	//BubbleSort(a7, N);
	int end7 = clock();

	printf("InsertSort:%d\n", end1 - begin1);
	printf("ShellSort:%d\n", end2 - begin2);
	printf("SelectSort:%d\n", end3 - begin3);
	printf("HeapSort:%d\n", end4 - begin4);
	printf("BubbleSort:%d\n", end7 - begin7);
	printf("QuickSort:%d\n", end5 - begin5);
	printf("MergeSort:%d\n", end6 - begin6);

	free(a1);
	free(a2);
	free(a3);
	free(a4);
	free(a5);
	free(a6);
}

int main()
{

	//TestInsertSort();

	//TestShellSort();

	//TestSelectSortP();

	//TestBubbleSort();

	//TestHeapSort();

	//TestQuickSort();

	//TestOptimizeQuickSort();

	//TestQuickSortNonR();

	//TestMergeSort();

	TestMergeSortNonR();

	//TestOP();


	return 0;
}